0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : run_E %s %d THM 0.13/0.33 % Computer : n025.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Aug 9 02:16:41 EDT 2022 0.13/0.34 % CPUTime : 0.20/0.47 Running higher-order on 8 cores theorem proving 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.47 # Version: 3.0pre003-ho 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.48 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.48 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.48 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.20/0.48 # Starting almost_fo_3_lam with 120s (1) cores 0.20/0.48 # Starting post_as_ho1 with 120s (1) cores 0.20/0.48 # ho_unfolding_3 with pid 10767 completed with status 0 0.20/0.48 # Result found by ho_unfolding_3 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.48 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.48 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.48 # No SInE strategy applied 0.20/0.48 # Search class: HGHNS-FFSF32-SHSSMFNN 0.20/0.48 # partial match(2): HGHNF-FFSF22-SHSSMFNN 0.20/0.48 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.48 # Starting new_ho_10 with 325s (1) cores 0.20/0.48 # Starting ho_unfolding_3 with 61s (1) cores 0.20/0.48 # Starting ehoh_best_sine_rwall with 55s (1) cores 0.20/0.48 # Starting lpo1_def_fix with 55s (1) cores 0.20/0.48 # Starting ehoh_best8_lambda with 55s (1) cores 0.20/0.48 # ho_unfolding_3 with pid 10774 completed with status 0 0.20/0.48 # Result found by ho_unfolding_3 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.48 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.48 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.48 # No SInE strategy applied 0.20/0.48 # Search class: HGHNS-FFSF32-SHSSMFNN 0.20/0.48 # partial match(2): HGHNF-FFSF22-SHSSMFNN 0.20/0.48 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.48 # Starting new_ho_10 with 325s (1) cores 0.20/0.48 # Starting ho_unfolding_3 with 61s (1) cores 0.20/0.48 # Preprocessing time : 0.001 s 0.20/0.48 # Presaturation interreduction done 0.20/0.48 0.20/0.48 # Proof found! 0.20/0.48 # SZS status Theorem 0.20/0.48 # SZS output start CNFRefutation 0.20/0.48 thf(decl_22, type, mrel: mworld > mworld > $o). 0.20/0.48 thf(decl_23, type, mactual: mworld). 0.20/0.48 thf(decl_24, type, mlocal: (mworld > $o) > $o). 0.20/0.48 thf(decl_25, type, mnot: (mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_30, type, mbox: (mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_31, type, mdia: (mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_32, type, mforall_di: ($i > mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_33, type, mexists_di: ($i > mworld > $o) > mworld > $o). 0.20/0.48 thf(decl_34, type, d: $i). 0.20/0.48 thf(decl_35, type, n: $i). 0.20/0.48 thf(decl_36, type, o: $i). 0.20/0.48 thf(decl_37, type, h: $i > mworld > $o). 0.20/0.48 thf(decl_38, type, closed: $i > mworld > $o). 0.20/0.48 thf(decl_39, type, combo: $i > $i > mworld > $o). 0.20/0.48 thf(decl_40, type, open: $i > mworld > $o). 0.20/0.48 thf(decl_41, type, epred1_1: mworld > $o). 0.20/0.48 thf(decl_42, type, esk1_0: $i). 0.20/0.48 thf(decl_43, type, esk2_0: mworld). 0.20/0.48 thf(decl_44, type, esk3_2: $i > $i > mworld). 0.20/0.48 thf(decl_45, type, esk4_3: mworld > $i > $i > $i). 0.20/0.48 thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mlocal_def)). 0.20/0.48 thf(mand_def, axiom, ((mand)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)&(X4 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mand_def)). 0.20/0.48 thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mimplies_def)). 0.20/0.48 thf(mbox_def, axiom, ((mbox)=(^[X1:mworld > $o, X3:mworld]:(![X5:mworld]:(((mrel @ X3 @ X5)=>(X1 @ X5)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mbox_def)). 0.20/0.48 thf(mexists_di_def, axiom, ((mexists_di)=(^[X8:$i > mworld > $o, X3:mworld]:(?[X7:$i]:((X8 @ X7 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mexists_di_def)). 0.20/0.48 thf(con, conjecture, (mlocal @ (mbox @ (mexists_di @ (^[X13:$i]:(mexists_di @ (^[X12:$i]:(mimplies @ (mbox @ (mand @ (combo @ d @ X13) @ (h @ X12))) @ (mbox @ (open @ d))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', con)). 0.20/0.48 thf(mrel_reflexive, axiom, ![X3:mworld]:((mrel @ X3 @ X3)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mrel_reflexive)). 0.20/0.48 thf(ax2, axiom, (mlocal @ (mbox @ (closed @ d))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax2)). 0.20/0.48 thf(mrel_transitive, axiom, ![X3:mworld, X5:mworld, X14:mworld]:((((mrel @ X3 @ X5)&(mrel @ X5 @ X14))=>(mrel @ X3 @ X14))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mrel_transitive)). 0.20/0.48 thf(mnot_def, axiom, ((mnot)=(^[X2:mworld > $o, X3:mworld]:(~((X2 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mnot_def)). 0.20/0.48 thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:((X6 @ X7 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mforall_di_def)). 0.20/0.48 thf(ax1, axiom, (mlocal @ (mbox @ (mforall_di @ (^[X10:$i]:(mforall_di @ (^[X11:$i]:(mexists_di @ (^[X12:$i]:(mand @ (mbox @ (mimplies @ (mand @ (closed @ X10) @ (mand @ (combo @ X10 @ X11) @ (h @ X12))) @ (mbox @ (open @ X10)))) @ (mbox @ (mimplies @ (mand @ (closed @ X10) @ (mand @ (mnot @ (combo @ X10 @ X11)) @ (h @ o))) @ (mbox @ (closed @ X10))))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax1)). 0.20/0.48 thf(c_0_12, plain, ![X28:mworld]:(((epred1_1 @ X28)<=>![X27:$i, X26:$i]:(?[X25:$i]:((![X22:mworld]:(((mrel @ X28 @ X22)=>(((closed @ X27 @ X22)&((combo @ X27 @ X26 @ X22)&(h @ X25 @ X22)))=>![X21:mworld]:(((mrel @ X22 @ X21)=>(open @ X27 @ X21))))))&![X24:mworld]:(((mrel @ X28 @ X24)=>(((closed @ X27 @ X24)&(~(combo @ X27 @ X26 @ X24)&(h @ o @ X24)))=>![X23:mworld]:(((mrel @ X24 @ X23)=>(closed @ X27 @ X23))))))))))), introduced(definition)). 0.20/0.48 thf(c_0_13, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])). 0.20/0.48 thf(c_0_14, plain, ((mand)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand_def])). 0.20/0.48 thf(c_0_15, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])). 0.20/0.48 thf(c_0_16, plain, ((mbox)=(^[Z0:mworld > $o, Z1:mworld]:(![X5:mworld]:(((mrel @ Z1 @ X5)=>(Z0 @ X5)))))), inference(fof_simplification,[status(thm)],[mbox_def])). 0.20/0.48 thf(c_0_17, plain, ((mexists_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(?[X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mexists_di_def])). 0.20/0.48 thf(c_0_18, plain, ![X28:mworld]:(((epred1_1 @ X28)=>![X27:$i, X26:$i]:(?[X25:$i]:((![X22:mworld]:(((mrel @ X28 @ X22)=>(((closed @ X27 @ X22)&((combo @ X27 @ X26 @ X22)&(h @ X25 @ X22)))=>![X21:mworld]:(((mrel @ X22 @ X21)=>(open @ X27 @ X21))))))&![X24:mworld]:(((mrel @ X28 @ X24)=>(((closed @ X27 @ X24)&(~(combo @ X27 @ X26 @ X24)&(h @ o @ X24)))=>![X23:mworld]:(((mrel @ X24 @ X23)=>(closed @ X27 @ X23))))))))))), inference(split_equiv,[status(thm)],[c_0_12])). 0.20/0.48 thf(c_0_19, negated_conjecture, ~(![X35:mworld]:(((mrel @ mactual @ X35)=>?[X34:$i, X33:$i]:((![X31:mworld]:(((mrel @ X35 @ X31)=>((combo @ d @ X34 @ X31)&(h @ X33 @ X31))))=>![X32:mworld]:(((mrel @ X35 @ X32)=>(open @ d @ X32)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]), c_0_13]), c_0_14]), c_0_15]), c_0_16]), c_0_17])). 0.20/0.48 thf(c_0_20, plain, ![X54:mworld, X55:$i, X56:$i, X58:mworld, X59:mworld, X60:$i, X61:$i, X62:mworld, X63:mworld]:(((~(mrel @ X54 @ X58)|(~(closed @ X55 @ X58)|(~(combo @ X55 @ X56 @ X58)|~(h @ (esk4_3 @ X54 @ X55 @ X56) @ X58))|(~(mrel @ X58 @ X59)|(open @ X55 @ X59)))|~(epred1_1 @ X54))&(~(mrel @ X54 @ X62)|(~(closed @ X60 @ X62)|((combo @ X60 @ X61 @ X62)|~(h @ o @ X62))|(~(mrel @ X62 @ X63)|(closed @ X60 @ X63)))|~(epred1_1 @ X54)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])])). 0.20/0.48 thf(c_0_21, negated_conjecture, ![X45:$i, X46:$i, X47:mworld]:(((mrel @ mactual @ esk2_0)&((((combo @ d @ X45 @ X47)|~(mrel @ esk2_0 @ X47))&((h @ X46 @ X47)|~(mrel @ esk2_0 @ X47)))&((mrel @ esk2_0 @ (esk3_2 @ X45 @ X46))&~(open @ d @ (esk3_2 @ X45 @ X46)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])). 0.20/0.48 thf(c_0_22, plain, ![X9:$i, X7:$i, X14:mworld, X5:mworld, X3:mworld]:(((open @ X7 @ X14)|~((mrel @ X3 @ X5))|~((closed @ X7 @ X5))|~((combo @ X7 @ X9 @ X5))|~((h @ (esk4_3 @ X3 @ X7 @ X9) @ X5))|~((mrel @ X5 @ X14))|~((epred1_1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_20])). 0.20/0.48 thf(c_0_23, negated_conjecture, ![X7:$i, X3:mworld]:(((h @ X7 @ X3)|~((mrel @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.20/0.48 thf(c_0_24, negated_conjecture, ![X9:$i, X7:$i, X3:mworld, X5:mworld, X14:mworld]:(((open @ X7 @ X3)|~((combo @ X7 @ X9 @ X5))|~((mrel @ esk2_0 @ X5))|~((closed @ X7 @ X5))|~((mrel @ X5 @ X3))|~((mrel @ X14 @ X5))|~((epred1_1 @ X14)))), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.20/0.48 thf(c_0_25, negated_conjecture, ![X7:$i, X3:mworld]:(((combo @ d @ X7 @ X3)|~((mrel @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.20/0.48 thf(c_0_26, plain, ![X40:mworld]:((mrel @ X40 @ X40)), inference(variable_rename,[status(thm)],[mrel_reflexive])). 0.20/0.48 thf(c_0_27, plain, ![X36:mworld]:(((mrel @ mactual @ X36)=>(closed @ d @ X36))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax2, c_0_13]), c_0_16])). 0.20/0.48 thf(c_0_28, negated_conjecture, ![X3:mworld, X5:mworld, X14:mworld]:(((open @ d @ X3)|~((mrel @ esk2_0 @ X5))|~((closed @ d @ X5))|~((mrel @ X5 @ X3))|~((mrel @ X14 @ X5))|~((epred1_1 @ X14)))), inference(spm,[status(thm)],[c_0_24, c_0_25])). 0.20/0.48 thf(c_0_29, plain, ![X3:mworld]:((mrel @ X3 @ X3)), inference(split_conjunct,[status(thm)],[c_0_26])). 0.20/0.48 thf(c_0_30, plain, ![X49:mworld]:((~(mrel @ mactual @ X49)|(closed @ d @ X49))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])). 0.20/0.48 thf(c_0_31, plain, ![X50:mworld, X51:mworld, X52:mworld]:((~(mrel @ X50 @ X51)|~(mrel @ X51 @ X52)|(mrel @ X50 @ X52))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mrel_transitive])])). 0.20/0.48 thf(c_0_32, plain, ((mnot)=(^[Z0:mworld > $o, Z1:mworld]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot_def])). 0.20/0.48 thf(c_0_33, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_di_def])). 0.20/0.48 thf(c_0_34, negated_conjecture, ![X3:mworld, X5:mworld]:(((open @ d @ X3)|~((closed @ d @ esk2_0))|~((mrel @ esk2_0 @ X3))|~((mrel @ X5 @ esk2_0))|~((epred1_1 @ X5)))), inference(spm,[status(thm)],[c_0_28, c_0_29])). 0.20/0.48 thf(c_0_35, plain, ![X3:mworld]:(((closed @ d @ X3)|~((mrel @ mactual @ X3)))), inference(split_conjunct,[status(thm)],[c_0_30])). 0.20/0.48 thf(c_0_36, negated_conjecture, (mrel @ mactual @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_21])). 0.20/0.48 thf(c_0_37, plain, ![X3:mworld, X5:mworld, X14:mworld]:(((mrel @ X3 @ X14)|~((mrel @ X3 @ X5))|~((mrel @ X5 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_31])). 0.20/0.48 thf(c_0_38, negated_conjecture, ![X7:$i, X9:$i]:((mrel @ esk2_0 @ (esk3_2 @ X7 @ X9))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.20/0.48 thf(c_0_39, plain, ![X28:mworld]:(((mrel @ mactual @ X28)=>(epred1_1 @ X28))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax1]), c_0_13]), c_0_32]), c_0_14]), c_0_15]), c_0_16]), c_0_33]), c_0_17])]), c_0_12])). 0.20/0.48 thf(c_0_40, negated_conjecture, ![X3:mworld, X5:mworld]:(((open @ d @ X3)|~((mrel @ esk2_0 @ X3))|~((mrel @ X5 @ esk2_0))|~((epred1_1 @ X5)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])])). 0.20/0.48 thf(c_0_41, negated_conjecture, ![X9:$i, X7:$i, X3:mworld]:(((mrel @ X3 @ (esk3_2 @ X7 @ X9))|~((mrel @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_37, c_0_38])). 0.20/0.48 thf(c_0_42, negated_conjecture, ![X7:$i, X9:$i]:(~((open @ d @ (esk3_2 @ X7 @ X9)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.20/0.48 thf(c_0_43, plain, ![X41:mworld]:((~(mrel @ mactual @ X41)|(epred1_1 @ X41))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])). 0.20/0.48 thf(c_0_44, negated_conjecture, ![X3:mworld]:((~((mrel @ X3 @ esk2_0))|~((epred1_1 @ X3)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_29])]), c_0_42])). 0.20/0.48 thf(c_0_45, plain, ![X3:mworld]:(((epred1_1 @ X3)|~((mrel @ mactual @ X3)))), inference(split_conjunct,[status(thm)],[c_0_43])). 0.20/0.48 thf(c_0_46, negated_conjecture, ![X3:mworld]:((~((mrel @ X3 @ esk2_0))|~((mrel @ mactual @ X3)))), inference(spm,[status(thm)],[c_0_44, c_0_45])). 0.20/0.48 thf(c_0_47, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_36]), c_0_29])]), ['proof']). 0.20/0.48 # SZS output end CNFRefutation 0.20/0.48 # Parsed axioms : 38 0.20/0.48 # Removed by relevancy pruning/SinE : 0 0.20/0.48 # Initial clauses : 34 0.20/0.48 # Removed in clause preprocessing : 21 0.20/0.48 # Initial clauses in saturation : 13 0.20/0.48 # Processed clauses : 43 0.20/0.48 # ...of these trivial : 0 0.20/0.48 # ...subsumed : 4 0.20/0.48 # ...remaining for further processing : 39 0.20/0.48 # Other redundant clauses eliminated : 0 0.20/0.48 # Clauses deleted for lack of memory : 0 0.20/0.48 # Backward-subsumed : 2 0.20/0.48 # Backward-rewritten : 0 0.20/0.48 # Generated clauses : 35 0.20/0.48 # ...of the previous two non-redundant : 31 0.20/0.48 # ...aggressively subsumed : 0 0.20/0.48 # Contextual simplify-reflections : 0 0.20/0.48 # Paramodulations : 35 0.20/0.48 # Factorizations : 0 0.20/0.48 # NegExts : 0 0.20/0.48 # Equation resolutions : 0 0.20/0.48 # Propositional unsat checks : 0 0.20/0.48 # Propositional check models : 0 0.20/0.48 # Propositional check unsatisfiable : 0 0.20/0.48 # Propositional clauses : 0 0.20/0.48 # Propositional clauses after purity: 0 0.20/0.48 # Propositional unsat core size : 0 0.20/0.48 # Propositional preprocessing time : 0.000 0.20/0.48 # Propositional encoding time : 0.000 0.20/0.48 # Propositional solver time : 0.000 0.20/0.48 # Success case prop preproc time : 0.000 0.20/0.48 # Success case prop encoding time : 0.000 0.20/0.48 # Success case prop solver time : 0.000 0.20/0.48 # Current number of processed clauses : 24 0.20/0.48 # Positive orientable unit clauses : 3 0.20/0.48 # Positive unorientable unit clauses: 0 0.20/0.48 # Negative unit clauses : 1 0.20/0.48 # Non-unit-clauses : 20 0.20/0.48 # Current number of unprocessed clauses: 13 0.20/0.48 # ...number of literals in the above : 71 0.20/0.48 # Current number of archived formulas : 0 0.20/0.48 # Current number of archived clauses : 15 0.20/0.48 # Clause-clause subsumption calls (NU) : 110 0.20/0.48 # Rec. Clause-clause subsumption calls : 42 0.20/0.48 # Non-unit clause-clause subsumptions : 6 0.20/0.48 # Unit Clause-clause subsumption calls : 0 0.20/0.48 # Rewrite failures with RHS unbound : 0 0.20/0.48 # BW rewrite match attempts : 2 0.20/0.48 # BW rewrite match successes : 0 0.20/0.48 # Condensation attempts : 43 0.20/0.48 # Condensation successes : 0 0.20/0.48 # Termbank termtop insertions : 4090 0.20/0.48 0.20/0.48 # ------------------------------------------------- 0.20/0.48 # User time : 0.007 s 0.20/0.48 # System time : 0.005 s 0.20/0.48 # Total time : 0.012 s 0.20/0.48 # Maximum resident set size: 2028 pages 0.20/0.48 0.20/0.48 # ------------------------------------------------- 0.20/0.48 # User time : 0.022 s 0.20/0.48 # System time : 0.011 s 0.20/0.48 # Total time : 0.033 s 0.20/0.48 # Maximum resident set size: 1788 pages 0.20/0.48 EOF